//--------------------------------------------------------------
//
// Size Computation on graph
//
//                                      ripertl
//
//--------------------------------------------------------------

// returns in exits_tab a number size of exits which respect the following
// conditions : 
// If more exits are found they will be discarded
// If less exits are found, the exits_tab will be filled with -1.
int get_exits(igraph_t *graph, int start, int *exits_tab, int size);

int get_exits_bubbles(igraph_t *graph, int start, int *exits_tab, int size);
